Transfinite Games - To the infinite and beyond!
نویسندگان
چکیده
منابع مشابه
Admissibility in Infinite Games
We analyse the notion of iterated admissibility, i.e., avoidance of weakly dominated strategies, as a solution concept for extensive games of infinite horizon. This concept is known to provide a valuable criterion for selecting among multiple equilibria and to yield sharp predictions in finite games. However, generalisations to the infinite are inherently problematic, due to unbounded dominance...
متن کاملDeterminacy and Π 11 transfinite recursion along ω
It is known that almost all important set existence axioms in second order arithmetic can be characterized by determinacy schemes of infinite games. In this article, we sketch the proof of the equivalence between Π1 transfinite recursion along ω and determinacy scheme.
متن کاملA Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract)
We consider a dynamical approach to sequential games. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding restriction of better-response dynamics will converge to a Nash equilibrium in quadratic time. Convergence happens on a per-player basis, and even in the presence of pla...
متن کاملMemoryless Determinacy of Infinite Parity Games: Another Simple Proof
The memoryless determinacy of infinite parity games was proven independently by Emerson and Jutla [1], and Mostowski [4], with various applications in computer science. Then Zielonka [5] provided an elegant and simple argument. Several simpler proofs can be found in the literature in the case where the underlying graph is finite. These proofs usually proceed by induction on the number of releva...
متن کاملTeam building in dependence
Hintikka and Sandu’s Independence-Friendly Logic was introduced as a logic for partially ordered quantification, in which the independence of (existential) quantifiers from previous (universal) quantifiers is written by explicit syntax. It was originally given a semantics by games of imperfect information; Hodges then gave a (necessarily) second-order Tarskian semantics. More recently, Väänänen...
متن کامل